Uncertainty Learning Using SVMs and CRFs

نویسنده

  • Vinodkumar Prabhakaran
چکیده

In this work, we explore the use of SVMs and CRFs in the problem of predicting certainty in sentences. We consider this as a task of tagging uncertainty cues in context, for which we used lexical, wordlist-based and deep-syntactic features. Results show that the syntactic context of the tokens in conjunction with the wordlist-based features turned out to be useful in predicting uncertainty cues.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conditional Random Fields and Support Vector Machines for Disorder Named Entity Recognition in Clinical Texts

We present a comparative study between two machine learning methods, Conditional Random Fields and Support Vector Machines for clinical named entity recognition. We explore their applicability to clinical domain. Evaluation against a set of gold standard named entities shows that CRFs outperform SVMs. The best F-score with CRFs is 0.86 and for the SVMs is 0.64 as compared to a baseline of 0.60.

متن کامل

Conditional Random Fields: Discriminative Training over Statistical features for Named Entity Recognition

We describe the experiments of the two learning algorithms for Named Entity Recognition. One implements Conditional Random Fields (CRFs), another makes use of Support Vector Machines (SVMs). Both are trained with a large number of features. While SVMs employ purely input features, CRFs also exploit statistical aspects in terms of unigram and bigram of both features and output tags. The main cha...

متن کامل

A Primal-Dual Message-Passing Algorithm for Approximated Large Scale Structured Prediction

In this paper we propose an approximated structured prediction framework for large scale graphical models and derive message-passing algorithms for learning their parameters efficiently. We first relate CRFs and structured SVMs and show that in CRFs a variant of the log-partition function, known as the soft-max, smoothly approximates the hinge loss function of structured SVMs. We then propose a...

متن کامل

POS tagging in Amazighe using tokenization and n-gram character feature set

The aim of this paper is to present the first Amazighe POS tagger. Very few linguistic resources have been developed so far for Amazighe and we believe that the development of a POS tagger tool is the first step needed for automatic text processing. In order to achieve this endeavor, we have trained two sequence classification models using Support Vector Machines (SVMs) and Conditional Random F...

متن کامل

Semi-Supervised Learning of Statistical Models for Natural Language Understanding

Natural language understanding is to specify a computational model that maps sentences to their semantic mean representation. In this paper, we propose a novel framework to train the statistical models without using expensive fully annotated data. In particular, the input of our framework is a set of sentences labeled with abstract semantic annotations. These annotations encode the underlying e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010